Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
نویسندگان
چکیده
Unravelings are transformations from conditional term rewriting systems(CTRSs) into unconditional term rewriting systems (TRSs) over extended signatures.They are complete, but in general, not sound w.r.t. reduction. Here, soundness w.r.t. reduction for a CTRS means that for every term over the original signature of the CTRS,if the corresponding unraveled TRS reduces the term to a term over the original signa-ture, then so does the original CTRS. In this paper, we show that an optimized variant of Ohlebusch’s unraveling for deterministic CTRSs is sound w.r.t. reduction if the correspond-ing unraveled TRSs are left-linear, or both right-linear and non-erasing. Then, we showthat soundness of the variant implies soundness of Ohlebusch’s unraveling, and show that soundness of Marchiori’s unravelings for join and normal CTRSs also implies soundness ofOhlebusch’s unraveling. Finally, we show that soundness of a transformation proposed byŞerbănuţă and Roşu for deterministic CTRSs implies soundness of Ohlebusch’s unraveling.
منابع مشابه
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short) over the extended signature. They are not always sound for every CTRS w.r.t. the reduction, while they are complete. Here, soundness w.r.t. the reduction means that every reduction sequence of the corresponding unrave...
متن کاملOn Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
We study (un)soundness of transformations of conditional term rewriting systems (CTRSs) into unconditional term rewriting systems (TRSs). The focus here is on analyzing (un)soundness of so-called unravelings, the most basic and natural class of such transformations. We extend our previous analysis from normal 1-CTRSs to the more general class of deterministic CTRSs (DCTRSs) where extra variable...
متن کاملOn (Un)Soundness of Unravelings
We revisit (un)soundness of transformations of conditional into unconditional rewrite systems. The focus here is on so-called unravelings, the most simple and natural kind of such transformations, for the class of normal conditional systems without extra variables. By a systematic and thorough study of existing counterexamples and of the potential sources of unsoundness we obtain several new po...
متن کاملConfluence of Conditional Term Rewrite Systems via Transformations
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...
متن کاملUnravelings and Ultra-properties
Conditional rewriting is universally recognized as being much more complicated than unconditional rewriting In this paper we study how much of conditional rewriting can be automatically inferred from the simpler theory of unconditional rewriting We introduce a new tool called unraveling to automatically translate a conditional term rewriting system CTRS into a term rewriting system TRS An unrav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 8 شماره
صفحات -
تاریخ انتشار 2012